Computability logic - PDFSEARCH.IO - Document Search Engine

Computability logic
Results: 552

#	Item
451	Microsoft PowerPoint - IMS Public Lecture - Slaman Add to Reading List Source URL: www.ims.nus.edu.sg Language: English - Date: 2010-01-12 23:03:20 Mathematical logic Mathematics Kurt Gödel National University of Singapore Philosophy Knowledge Academia Theodore Slaman Computability theory
452	ENUMERATION 1-GENERICITY IN THE LOCAL ENUMERATION DEGREES. LILIANA BADILLO† , CHARLES M. HARRIS‡ , AND MARIYA I. SOSKOVA§∗ Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2013-01-04 08:50:43 Forcing Enumeration Mathematical logic Logic Theory of computation Philosophy of mathematics Turing degree Generic programming Mathematics Enumerative combinatorics Computability theory
453	Splitting and Nonsplitting in the Σ02 Enumeration Degrees∗ M. M. Arslanov1 , S. B. Cooper2 , I. Sh. Kalimullin1 Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2009-10-12 05:07:37 Mathematical logic Symbol Logic Computable function Structure Model theory Busy beaver Spinor Theory of computation Mathematics Computability theory
454	THE AUTOMORPHISM GROUP OF THE ENUMERATION DEGREES MARIYA I. SOSKOVA† Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2013-11-11 20:26:54 Philosophy of mathematics Turing degree Turing jump Enumeration Theodore Slaman Arithmetical set Computability theory Mathematics Logic
455	The Local Structure of the Enumeration Degrees Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2008-07-19 09:57:30 Enumerative combinatorics Mathematical logic Enumeration Recursively enumerable set Degree Turing degree Mathematics Computability theory Theory of computation
456	CiE Athens 2008 Applied Computability: A European Perspective J V Tucker Swansea University General Reflections on Models J V Tucker and J I Zucker, Abstract versus concrete computability: The case of countable Add to Reading List Source URL: www-compsci.swan.ac.uk Language: English - Date: 2008-06-11 09:22:18 John V. Tucker Computer science Computability theory Logic Viggo Stoltenberg-Hansen Mathematical logic Computable function Computability Theoretical computer science Theory of computation Alumni of the University of Bristol
457	Abstract Versus Concrete Computation on Metric Partial Algebras J. V. TUCKER University of Wales, Swansea and J. I. ZUCKER Add to Reading List Source URL: www-compsci.swan.ac.uk Language: English - Date: 2004-12-07 12:09:43 Theoretical computer science Mathematical logic Computable function John V. Tucker Von Neumann algebra Computability Mathematical analysis Function Gelfand representation Computability theory Theory of computation Mathematics
458	PROGRAMME Sunday, 19 July 2009 CiE 2009 Mathematical Theory and Add to Reading List Source URL: www.math.uni-heidelberg.de Language: English - Date: 2009-07-30 07:35:12 Computer science Mathematics Hypercomputation Mathematical logic Algorithm Computable number Recursively enumerable set Turing reduction Computability Theory of computation Computability theory Theoretical computer science
459	The Turing universe in the context of enumeration reducibility Mariya I. Soskova Sofia University and University of California, Berkeley A fundamental goal of computability theory is to understand the way that Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2013-11-11 20:32:42 Mathematics Turing degree Turing reduction Turing jump Enumeration Low Recursively enumerable set Arithmetical hierarchy Halting problem Computability theory Theoretical computer science Mathematical logic

UPDATE